Maximal Monotonicity via Convex Analysis

نویسندگان

  • JONATHAN M. BORWEIN
  • JONATHAN BORWEIN
چکیده

In his ‘23’ “Mathematische Probleme” lecture to the Paris International Congress in 1900, David Hilbert wrote “Besides it is an error to believe that rigor in the proof is the enemy of simplicity.” In this spirit, we use simple convex analytic methods, relying on an ingenious function due to Simon Fitzpatrick, to provide a concise proof of the maximality of the sum of two maximal monotone operators on reflexive Banach space under standard transversality conditions. Many other extension, surjectivity, convexity and local boundedness results are likewise established.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximal Monotonicity of Dense Type, Local Maximal Monotonicity, and Monotonicity of the Conjugate Are All the Same for Continuous Linear Operators

The concept of a monotone operator — which covers both linear positive semi-definite operators and subdifferentials of convex functions — is fundamental in various branches of mathematics. Over the last few decades, several stronger notions of monotonicity have been introduced: Gossez’s maximal monotonicity of dense type, Fitzpatrick and Phelps’s local maximal monotonicity, and Simons’s monoton...

متن کامل

Partial second-order subdifferentials of -prox-regular functions

Although prox-regular functions in general are nonconvex, they possess properties that one would expect to find in convex or lowerC2  functions. The class of prox-regular functions covers all convex functions, lower C2  functions and strongly amenable functions. At first, these functions have been identified in finite dimension using proximal subdifferential. Then, the definition of prox-regula...

متن کامل

Sum Formula for Maximal Abstract Monotonicity and Abstract Rockafellar’s Surjectivity Theorem

In this paper, we present an example in which the sum of two maximal abstract monotone operators is maximal. Also, we shall show that the necessary condition for Rockafellar’s surjectivity which was obtained in ([19], Theorem 4.3) can be sufficient.

متن کامل

Techniques for maximal monotonicity

The purpose of this paper is to describe three techniques that are useful for the investigation of monotone sets and multifunctions, and give two applications of them. The three techniques use the “fg–theorem”, the “big convexification” of a subset of E × E∗ or a multifunction E 7→ 2E (we suppose throughout that E is a nontrivial real Banach space with dual E∗), and the “convex function associa...

متن کامل

LC-functions and maximal monotonicity

In this paper, we consider LC–functions, a class of special convex functions from the product of a reflexive Banach space and its dual into ]−∞,∞]. Using Fitzpatrick functions, we will show that the theory of LC–functions is a proper extension of the theory of maximal monotone sets. Various versons of the Fenchel duality theorem lead to a number of results on maximal monotonicity, some of them ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005